#include<bits/stdc++.h>
using namespace std;
int main()
{
	int n, target;
	cin>>n>>target;
	vector<int> nums(n);
	for(int i = 0;i < n;i++)
		cin>>nums[i];
	
	map<int, int> mp;
	int flag = 0;
	for(int i = 0;i < n;i++)
	{
		auto index = mp.find(target-nums[i]);
		if(index != mp.end())
		{
			cout<<min(index->second, i)<<" "<<max(index->second, i);
			flag = 1;
			break;
		}
		else
			mp[nums[i]] = i;
	}
	if(!flag)
		cout<<"false";
	return 0;
}

